From $\mu$-Regular Expressions to Pushdown Automata
نویسنده
چکیده
We extend Antimirov’s partial derivatives from regular expressions to μ-regular expressions that describe context-free languages. We prove the correctness of partial derivatives as well as the finiteness of the set of iterated partial derivatives. The latter are used as pushdown symbols in our construction of a nondeterministic pushdown automaton, which generalizes Antimirov’s NFA construction.
منابع مشابه
A Generalization of Regular Expressions
CF-expressions are defined which generalize the regular one. It is established that so called pseudo-coiterating CF-expressions characterize the regular sets. The results are used to develop some more characterizations of the regular sets: the pseudo-coiterating D-graphs and the pseudo-coiterating pushdown automata (PDAs). An algorithm is presented for deciding whether a device of three mention...
متن کاملA Genetic Algorithm for the Induction of Nondeterministic Pushdown Automata
This paper presents a genetic algorithm used to infer pushdown automata from legal and illegal examples of a language. It gives an introduction into grammatical inference, and discusses related work in grammatical inference using genetic algorithms. The paper describes the type of automaton that is used, the evaluation of the fitness of automata with respect to a set of examples of a language, ...
متن کاملOne-stack Automata as Acceptors of Context-free Languages*
This paper presents one-stack automata as acceptors of context-free languages; these are equivalent to Pushdown Automata which are well known in automata theory. As equivalence relations such as equivalence of Turing Machines and two-stack Pushdown Automata help in learning general properties of formal modeling, the equivalence relation of Pushdown Automata and one-stack automata also helps in ...
متن کاملA Proof of the Pumping Lemma for Context-Free Languages Through Pushdown Automata
The pumping lemma for context-free languages is a result about pushdown automata which is strikingly similar to the well-known pumping lemma for regular languages. However, though the lemma for regular languages is simply proved by using the pigeonhole principle on deterministic automata, the lemma for pushdown automata is proven through an equivalence with context-free languages and through th...
متن کاملUnary Pushdown Automata and Straight-Line Programs
We consider decision problems for deterministic pushdown automata over a unary alphabet (udpda, for short). Udpda are a simple computation model that accept exactly the unary regular languages, but can be exponentially more succinct than finite-state automata. We complete the complexity landscape for udpda by showing that emptiness (and thus universality) is P-hard, equivalence and compressed m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016